Performance Analysis Based on Density Evolution on Fault Erasure Belief Propagation Decoder
نویسندگان
چکیده
منابع مشابه
Performance Analysis Based on Density Evolution on Fault Erasure Belief Propagation Decoder
In this paper, we will present an analysis on the fault erasure BP decoders based on the density evolution. In the fault BP decoder, messages exchanged in a BP process are stochastically corrupted due to unreliable logic gates and flip-flops; i.e., we assume circuit components with transient faults. We derived a set of the density evolution equations for the fault erasure BP processes. Our dens...
متن کاملIterative turbo decoder analysis based on density evolution
We track the density of extrinsic information in iterative turbo decoders by actual density evolution, and also approximate it by consistent Gaussian density functions. The approximate model is verified by experimental measurements. We view the evolution of these density functions through an iterative decoder as a nonlinear dynamical system with feedback. Iterative decoding of turbo codes and o...
متن کاملIterative Turbo Decoder Analysis Based on Gaussian Density Evolution
nels was computed. Wiberg [3] in his dissertation has W e model the density of extrinsic information in iterative turbo decoders by Gaussian density functions. This model is verified by experimental measurements. We consider evolution of these density functions through the iterative turbo decoder as a nonlinear dynamical system with feedback. Iterative decoding of turbo codes and of serially co...
متن کاملContour Matching Based on Belief Propagation
In this paper, we try to use graphical model based probabilistic inference methods to solve the problem of contour matching, which is a fundamental problem in computer vision. Specifically, belief propagation is used to develop the contour matching framework. First, an undirected loopy graph is constructed by treating each point of source contour as a graphical node. Then, the distances between...
متن کاملFault-Tolerant Multi-Agent Exact Belief Propagation
Multiply sectioned Bayesian networks (MSBNs) support multiagent probabilistic inference in distributed large problem domains, where agents (subdomains) are organized by a tree structure (called hypertree). In earlier work, all belief updating methods on a hypertree are made of two rounds of propagation, each of which is implemented as a recursive process. Both processes need to be started from ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2016
ISSN: 0916-8508,1745-1337
DOI: 10.1587/transfun.e99.a.2155